Hybrid Partition Machines with Disturbances
نویسندگان
چکیده
The notions of finite analytic partition, dynamical consistency, and partition machine were originally developed in (Wei 1995; Caines &: Wei 1998) for dynamical systems on differentiable manifolds and in (Caines &~ Lemch 1999) for hybrid systems; in this paper they are generalized to hybrid systems with disturbances.
منابع مشابه
On Dynamically Consistent Hybrid Systems
The notion of dynamical consistency 3] is extended to hybrid systems so as to deene the set of dynamically consistent hybrid partition machines associated with a continuous system S. After the presentation of some basic results on the algebraic structure of discrete partition machines, dynamical consistency is deened for hybrid systems, and the lattice HIBC(S) of hybrid in-block controllable pa...
متن کاملOn the Existence of Hybrid Models for Finite State Machines
Within the framework of the hierarchical hybrid control theory presented in 3], one may pose the following hybrid modelling problem: for a given nite state machine M, nd a state space X, a state space partition , and a controlled ODE system S on X such that the associated hierarchical hybrid partition machine M based upon S is a hybrid in-block controllable (HIBC) machine satisfying M = M. In t...
متن کاملA comparison of algorithms for minimizing the sum of earliness and tardiness in hybrid flow-shop scheduling problem with unrelated parallel machines and sequence-dependent setup times
In this paper, the flow-shop scheduling problem with unrelated parallel machines at each stage as well as sequence-dependent setup times under minimization of the sum of earliness and tardiness are studied. The processing times, setup times and due-dates are known in advance. To solve the problem, we introduce a hybrid memetic algorithm as well as a particle swarm optimization algorithm combine...
متن کاملHeuristic approach to solve hybrid flow shop scheduling problem with unrelated parallel machines
In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...
متن کاملSolving a New Multi-objective Unrelated Parallel Machines Scheduling Problem by Hybrid Teaching-learning Based Optimization
This paper considers a scheduling problem of a set of independent jobs on unrelated parallel machines (UPMs) that minimizesthe maximum completion time (i.e., makespan or ), maximum earliness ( ), and maximum tardiness ( ) simultaneously. Jobs have non-identical due dates, sequence-dependent setup times and machine-dependentprocessing times. A multi-objective mixed-integer linear programmi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002